Ohba’s conjecture for graphs with independence number five
نویسندگان
چکیده
منابع مشابه
Ohba's conjecture for graphs with independence number five
Ohba has conjectured that if G is a k-chromatic graphwith at most 2k+1 vertices, then the list chromatic number or choosability ch(G) of G is equal to its chromatic number χ(G), which is k. It is known that this holds if G has independence number at most three. It is proved here that it holds if G has independence number at most five. In particular, and equivalently, it holds if G is a complete...
متن کاملOhba’s Conjecture is True for Graphs with Independence Number 3
Ohba’s conjecture states that if a graph G has chromatic number χ(G) = k and has at most 2k+1 vertices, then G has choice number Ch(G) equal to χ(G). We prove that Ohba’s conjecture is true for each graph that has independence number 3. We also prove that Ohba’s conjecture is true for each graph G that has an independent set S of size 4 such that G\S has independence number 3.
متن کاملApproximating Vizing's independence number conjecture
In 1965, Vizing conjectured that the independence ratio of edge-chromatic critical graphs is at most 1 2 . We prove that for every > 0 this conjecture is equivalent to its restriction on a specific set of edge-chromatic critical graphs with independence ratio smaller than 1 2 + .
متن کاملHadwiger's conjecture for graphs with infinite chromatic number
We construct a connected graph H such that (1) χ(H) = ω; (2) Kω, the complete graph on ω points, is not a minor of H . Therefore Hadwiger’s conjecture does not hold for graphs with infinite coloring number. 1. Notation In this note we are only concerned with simple undirected graphs G = (V,E) where V is a set and E ⊆ P2(V ) where P2(V ) = { {x, y} : x, y ∈ V and x 6= y } . We also require that ...
متن کاملIndependence Number and Disjoint Theta Graphs
The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a θ-graph to be a pair of vertices u, v with three internally disjoint paths joining u to v. Given an independence number α and a fixed integer k, the results contained in this paper provide sharp bounds on the order f(k, α) of a graph with independence number α(G) ≤ α which contains no k disjoint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.02.026